Balanced truncation model reduction for semidiscretized Stokes equation
نویسندگان
چکیده
منابع مشابه
Balanced Truncation Model Reduction for Semidiscretized Stokes Equation
We discuss model reduction of linear continuous-time descriptor systems that arise in the control of semidiscretized Stokes equations. Balanced truncation model reduction methods for descriptor systems are presented. These methods are closely related to the proper and improper controllability and observability Gramians and Hankel singular values of descriptor systems. The Gramians can be comput...
متن کاملDomain decomposition and balanced truncation model reduction for shape optimization of the Stokes system
The optimal design of structures and systems described by partial differential equations (PDEs) often gives rise to large-scale optimization problems, in particular if the underlying system of PDEs represents a multi-scale, multi-physics problem. Therefore, reduced order modeling techniques such as balanced truncation model reduction, proper orthogonal decomposition, or reduced basis methods ar...
متن کاملBalanced truncation model reduction of periodic systems
The balanced truncation approach to model reduction is considered for linear discrete-time periodic systems with time-varying dimensions. Stability of the reduced model is proved and a guaranteed additive bound is derived for the approximation error. These results represent generalizations of the corresponding ones for standard discrete-time systems. Two numerically reliable methods to compute ...
متن کاملOn Model Reduction for Periodic Descriptor Systems Using Balanced Truncation
Linear periodic descriptor systems represent a broad class of time evolutionary processes in micro-electronics and circuit simulation in particular. In this paper we consider discrete-time linear periodic descriptor systems and study the concepts of periodic reachability and observability of the systems based on earlier ideas of Chu et al. [1]. We define reachability and observability Gramians ...
متن کاملParallel Algorithms for Balanced Truncation Model Reduction of Sparse Systems
We describe the parallelization of an efficient algorithm for balanced truncation that allows to reduce models with state-space dimension up to O(10). The major computational task in this approach is the solution of two large-scale sparse Lyapunov equations, performed via a coupled LR-ADI iteration with (super-)linear convergence. Experimental results on a cluster of Intel Xeon processors illus...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2006
ISSN: 0024-3795
DOI: 10.1016/j.laa.2004.01.015